Verifying Mixed Real-Integer Quantifier Elimination
نویسنده
چکیده
We present a formally verified quantifier elimination procedure for the first order theory over linear mixed real-integer arithmetics in higher-order logic based on a work by Weispfenning. To this end we provide two verified quantifier elimination procedures: for Presburger arithmitics and for linear real arithmetics.
منابع مشابه
Reflecting Quantifier Elimination for Linear Arithmetic
This paper formalizes and verifies quantifier elimination procedures for dense linear orders and for real and integer linear arithmetic in the theorem prover Isabelle/HOL. It is a reflective formalization because it can be applied to HOL formulae themselves. In particular we obtain verified executable decision procedures for linear arithmetic. The formalization for the various theories is modul...
متن کاملEffective Algorithms for the Satisfiability of Quantifier-Free Formulas Over Linear Real and Integer Arithmetic
A core technique of modern tools for formally reasoning about computing systems is generating and dispatching queries to automated theorem provers, including Satisfiability Modulo Theories (SMT) provers. SMT provers aim at the tight integration of decision procedures for propositional satisfiability and decision procedures for fixed first-order theories – known as theory solvers. This thesis pr...
متن کاملVerifying and Reflecting Quantifier Elimination for Presburger Arithmetic
We present an implementation and verification in higherorder logic of Cooper’s quantifier elimination for Presburger arithmetic. Reflection, i.e. the direct execution in ML, yields a speed-up of a factor of 200 over an LCF-style implementation and performs as well as a decision procedure hand-coded in ML.
متن کاملFractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars
We present decision procedures for logical constraints involving collections such as sets, multisets, and fuzzy sets. Element membership in our collections is given by characteristic functions from a finite universe (of unknown size) to a user-defined subset of rational numbers. Our logic supports standard operators such as union, intersection, difference, or any operation defined pointwise usi...
متن کاملA Quantifier Elimination Algorithm for a Fragment of Set Theory Involving the Cardinality Operator
We present a decision procedure based on quantifier elimination for a fragment of set theory involving elements, integers, and finite sets of elements in the presence of the cardinality operator. The language allows quantification on element variables and integer variables, but not on set variables. We also show that if we identify the sort of elements with the sort of integers, thus considerin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006